ASIC-based Implementation of Synchronous Section-Carry Based Carry Lookahead Adders
نویسندگان
چکیده
The section-carry based carry lookahead adder (SCBCLA) topology was proposed as an improved high-speed alternative to the conventional carry lookahead adder (CCLA) topology in previous works. Selftimed and FPGA-based implementations of SCBCLAs and CCLAs were considered earlier, and it was found that SCBCLAs could help in delay reduction i.e. pave the way for improved speed compared to CCLAs at the expense of some increase in area and/or power parameters. In this work, we consider semi-custom ASIC-based implementations of different variants of SCBCLAs and CCLAs to perform 32-bit dual-operand addition. Based on the simulation results for 32-bit dual-operand addition obtained by targeting a high-end 32/28nm CMOS process, it is found that an optimized SCBCLA architecture reports a 9.8% improvement in figure-of-merit (FOM) compared to an optimized CCLA architecture, where the FOM is defined as the inverse of the product of power, delay, and area. It is generally inferred from the simulations that the SCBCLA architecture could be more beneficial compared to the CCLA architecture in terms of the design metrics whilst benefitting a variety of computer arithmetic operations involving dual-operand and/or multi-operand additions. Also, it is observed that heterogeneous CLA architectures tend to fare well compared to homogeneous CLA architectures, as substantiated by the simulation results. Key-Words: Addition, Ripple carry adder, Carry lookahead adder, ASIC, Semi-custom, CMOS, Standard cells
منابع مشابه
Design of Synchronous Section-Carry Based Carry Lookahead Adders with Improved Figure of Merit
The section-carry based carry lookahead adder (SCBCLA) architecture was proposed as an efficient alternative to the conventional carry lookahead adder (CCLA) architecture for the physical implementation of computer arithmetic. In previous related works, self-timed SCBCLA architectures and synchronous SCBCLA architectures were realized using standard cells and FPGAs. In this work, we deal with i...
متن کاملSelf-Timed Carry-Lookahead Adders
ÐInteger addition is one of the most important operations in digital computer systems because the performance of processors is significantly influenced by the speed of their adders. This paper proposes a self-timed carry-lookahead adder in which the logic complexity is a linear function of n, the number of inputs, and the average computation time is proportional to the logarithm of the logarith...
متن کاملHigh Performance Parallel Prefix Adders with Fast Carry Chain Logic
Binary adders are the basic and vital element in the circuit designs. Prefix adders are the most efficient binary adders for ASIC implementation. But these advantages are not suitable for FPGA implementation because of CLBs and routing constraints on FPGA. This paper presents different types of parallel prefix adders and compares them with the Simple Adder. The adders are designed using Verilog...
متن کاملRobust Asynchronous Carry Lookahead Adders
Novel gate level synthesis of robust asynchronous carry lookahead adders based on the notion of section carry is discussed in this paper. For a range of higher order addition operations, the carry lookahead adder is found to exhibit reduced latency than the carry ripple version by 38.6%. However, the latter occupies less area and dissipates less power compared to the former by 37.8% and 17.4% r...
متن کاملHigh Speed Multioutput 128bit Carry- Lookahead Adders Using Domino Logic
Addition is the fundamental operation for any VLSI processors or digital signal processing. In this paper focuses on carry -look ahead adders have done research on the design of high-speed, low-area, or low-power adders. Here domino logic is used for implementation and simulation of 128 bit Carrylook ahead adder based HSPICE Tool. In adder circuits propagation delay is the main drawback. To ove...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1603.07961 شماره
صفحات -
تاریخ انتشار 2016